Lecture 3 : Lower bound on statistically secure encryption , extractors
نویسندگان
چکیده
منابع مشابه
Universal Computational Extractors and the Superfluous Padding Assumption for Indistinguishability Obfuscation
Universal Computational Extractors (UCEs), introduced by Bellare, Hoang and Keelveedhi (CRYPTO 2013), are a framework of assumptions on hash functions that allow to instantiate random oracles in a large variety of settings. Brzuska, Farshim and Mittelbach (CRYPTO 2014) showed that a large class of UCE assumptions with computationally unpredictable sources cannot be achieved, if indistinguishabi...
متن کاملError Correction in the Bounded Storage Model
We initiate a study of Maurer’s bounded storage model (JoC, 1992) in presence of transmission errors and perhaps other types of errors that cause different parties to have inconsistent views of the public random source. Such errors seem inevitable in any implementation of the model. All previous schemes and protocols in the model assume a perfectly consistent view of the public source from all ...
متن کاملShannon Impossibility, Revisited
In this note we revisit the famous result of Shannon [Sha49] stating that any encryption scheme with perfect security against computationally unbounded attackers must have a secret key as long as the message. This result motivated the introduction of modern encryption schemes, which are secure only against a computationally bounded attacker, and allow some small (negligible) advantage to such a...
متن کاملCubic Root Extractors of Gaussian Integers and Their Application in Fast Encryption for Time-Constrained Secure Communication
There are settings where encryption must be performed by a sender under a time constraint. This paper describes an encryption/decryption algorithm based on modular arithmetic of complex integers called Gaussians. It is shown how cubic extractors operate and how to find all cubic roots of the Gaussian. All validations (proofs) are provided in the Appendix. Detailed numeric illustrations explain ...
متن کاملRobust Fuzzy Extractors and Helper Data Manipulation Attacks Revisited: Theory vs Practice
Fuzzy extractors have been proposed in 2004 by Dodis et al. as a secure way to generate cryptographic keys from noisy sources. In recent years, fuzzy extractors have become an important building block in hardware security due to their use in secure key generation based on Physical Unclonable Functions (PUFs). Fuzzy extractors are provably secure against passive attackers. A year later Boyen et ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015